Error Bounds for Consistent Reconstruction: Random Polytopes and Coverage Processes
نویسندگان
چکیده
منابع مشابه
Error bounds for consistent reconstruction: random polytopes and coverage processes
Consistent reconstruction is a method for producing an estimate x̃ ∈ R of a signal x ∈ R if one is given a collection ofN noisy linear measurements qn = 〈x, φn〉+ǫn, 1 ≤ n ≤ N , that have been corrupted by i.i.d. uniform noise {ǫn}n=1. We prove mean squared error bounds for consistent reconstruction when the measurement vectors {φn}n=1 ⊂ R are drawn independently at random from a suitable distrib...
متن کاملApproximation properties of random polytopes associated with Poisson hyperplane processes
We consider a stationary Poisson hyperplane process with given directional distribution and intensity in d-dimensional Euclidean space. Generalizing the zero cell of such a process, we fix a convex body K and consider the intersection of all closed halfspaces bounded by hyperplanes of the process and containing K. We study how well these random polytopes approximate K (measured by the Hausdorff...
متن کاملSharpened Error Bounds for Random Sampling Based $\ell_2$ Regression
Abstract. Given a data matrix X ∈ R and a response vector y ∈ R , suppose n > d, it costs O(nd) time and O(nd) space to solve the least squares regression (LSR) problem. When n and d are both large, exactly solving the LSR problem is very expensive. When n ≫ d, one feasible approach to accelerating LSR is to randomly embed y and all columns of X into the subspace R where c ≪ n; the induced LSR ...
متن کاملRandom polytopes
We prove the central limit theorem for the volume and the f -vector of the random polytope Pn and the Poisson random polytope Πn in a fixed convex polytope P ⊂ IR. Here Pn is the convex hull of n random points in P , and Πn is the convex hull of the intersection of a Poisson process X(n), of intensity n, with P . A general lower bound on the variance is also proved. ∗Supported by Hungarian Nati...
متن کاملBounds and error bounds for queueing networks
Queueing networks are an important means to model and evaluate a variety of practical systems. Unfortunately, analytic results are often not available. Numerical computation may then have to be employed. Or, system modifications might be suggested to obtain simple bounds or computationally easy approximations. Formal analytic support for the accuaracy or nature of such modifications or approxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2015
ISSN: 1615-3375,1615-3383
DOI: 10.1007/s10208-015-9251-2